About accuracy of the solution of NP-complete tasks

From the point of view of complexity of algorithm of discrete tasks exact decision, for which the polynomial of the task's dimensions (polynomial from length of an input) algorithms are existing, creates the class P. Discrete tasks, for which such algorithms are unknown, creates the class NP. Dimension here is understood as certain parameter (or parameters) which anyhow defines or quantity of examined objects, or quantity of actions which essentially should be presented at algorithm of the decision of a task. More particularly for the general case here nothing is possible to say, because virtue of that the variety of the tasks which are included in classes P and NP, is rather great.